Linear programming relaxation - PDFSEARCH.IO - Document Search Engine

Linear programming relaxation
Results: 230

#	Item
51	The Thousand Faces of Constraint Propagation Emmanuel Hebrard Toulouse Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-03-05 12:20:11 Mathematical optimization Constraint satisfaction problem Constraint satisfaction Local consistency Decomposition method Linear programming relaxation Constraint programming Software engineering Computer programming
52	Computational Experience with Generic Decomposition using the DIP Framework M.V. Galati∗ T.K. Ralphs† Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2012-09-15 17:55:19 Relaxation Linear programming Decomposition method Dantzig–Wolfe decomposition Cutting-plane method Lagrangian relaxation Mathematical optimization Operations research Convex optimization
53	Modelling Transit Paths for Military Vehicles Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 17:46:12 Operations research Convex optimization Optimal control Equations Lagrangian relaxation Dynamic programming Shortest path problem Linear programming Optimization problem Mathematics Mathematical optimization Applied mathematics
54	A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger † Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Operations research Linear programming relaxation Dynamic programming Shortest path problem Linear programming Dantzig–Wolfe decomposition Algorithm Minimum spanning tree Delayed column-generation Mathematics Mathematical optimization Applied mathematics
55	Branch, Cut, and Price: Sequential and Parallel ? T.K. Ralphs1 , L. Lad´anyi2 , and L.E. Trotter, Jr.3 1 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Applied mathematics Combinatorial optimization Linear programming Linear programming relaxation COIN-OR Branch and cut Algorithm Divide and conquer algorithm Optimization problem Mathematical optimization Mathematics Operations research
56	Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm Alexander G. Schwing University of Toronto, 10 King’s College Rd., Toronto, Canada Tamir Hazan University of Haifa, Haifa, Israel Add to Reading List Source URL: www.alexander-schwing.de Language: English - Date: 2014-05-11 20:22:32 Operations research Convex optimization Linear programming Relaxation Duality Quadratic programming Support vector machine Frank–Wolfe algorithm Gradient descent Mathematical optimization Numerical analysis Mathematics
57	Implementing Scalable Parallel Search Algorithms for Data-intensive Applications L. Lad´anyi1 , T. K. Ralphs?2 , and M. J. Saltzman3 1 Department of Mathematical Sciences, IBM T. J. Watson Research Center, Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:52 Applied mathematics Binary trees Linear programming Linear programming relaxation Relaxation Tree Divide and conquer algorithm Algorithm T-tree Mathematical optimization Mathematics Operations research
58	Mathematical Programming SERIES A and B Constraint aggregation for rigorous global optimization --Manuscript Draft-Manuscript Number: MAPR-D-14-00182R2 Add to Reading List Source URL: www.mat.univie.ac.at Language: English - Date: 2014-12-02 11:46:26 Applied mathematics Lagrange multiplier Quadratic programming Constraint Karush–Kuhn–Tucker conditions Linear programming Local consistency Relaxation Duality Mathematical optimization Mathematical analysis Mathematics
59	On Lagrangian Relaxation and Subset Selection Problems (Extended Abstract) Ariel Kulik∗ Hadas Shachnai† Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2008-06-23 10:33:06 Theoretical computer science Computational complexity theory Relaxation Linear programming Approximation algorithm Lagrangian relaxation Duality Spectral theory of ordinary differential equations Euclidean algorithm Mathematical optimization Mathematical analysis Convex optimization
60	Journal of Uncertain Systems Vol.x, No.x, pp.xx-xx, 2009 Online at: www.jus.org.uk A splitting technique for discrete search based on convex relaxation Martin Fuchs12∗ Arnold Neumaier2 Add to Reading List Source URL: www.mat.univie.ac.at Language: English - Date: 2009-09-02 12:30:26 Theoretical computer science Convex optimization Combinatorial optimization Linear programming Relaxation Branch and bound Mathematical optimization Operations research Applied mathematics

UPDATE